Minimax Optimal Rates of Estimation in High Dimensional Additive Models: Universal Phase Transition

نویسندگان

  • Ming Yuan
  • Ding-Xuan Zhou
چکیده

We establish minimax optimal rates of convergence for estimation in a high dimensional additive model assuming that it is approximately sparse. Our results reveal an interesting phase transition behavior universal to this class of high dimensional problems. In the sparse regime when the components are sufficiently smooth or the dimensionality is sufficiently large, the optimal rates are identical to those for high dimensional linear regression, and therefore there is no additional cost to entertain a nonparametric model. Otherwise, in the so-called smooth regime, the rates coincide with the optimal rates for estimating a univariate function, and therefore they are immune to the “curse of dimensionality”.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Regularization for High Dimensional Additive Models

We study the behavior of the l1 type of regularization for high dimensional additive models. Our results suggest remarkable similarities and differences between linear regression and additive models in high dimensional settings. In particular, our analysis indicates that, unlike in linear regression, l1 regularization does not yield optimal estimation for additive models of high dimensionality....

متن کامل

On the Minimax Optimality of Block Thresholded Wavelets Estimators for ?-Mixing Process

We propose a wavelet based regression function estimator for the estimation of the regression function for a sequence of ?-missing random variables with a common one-dimensional probability density function. Some asymptotic properties of the proposed estimator based on block thresholding are investigated. It is found that the estimators achieve optimal minimax convergence rates over large class...

متن کامل

Minimax-optimal rates for high-dimensional sparse additive models over kernel classes

Sparse additive models are families of d-variate functions that have the additive decomposition f = ∑ j∈S f ∗ j , where S is an unknown subset of cardinality s ≪ d. We consider the case where each component function f j lies in a reproducing kernel Hilbert space, and analyze an l1 kernel-based method for estimating the unknown function f . Working within a highdimensional framework that allows ...

متن کامل

Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming

Sparse additive models are families of d-variate functions that have the additive decomposition f∗ = ∑ j∈S f ∗ j , where S is a unknown subset of cardinality s d. We consider the case where each component function f∗ j lies in a reproducing kernel Hilbert space, and analyze a simple kernel-based convex program for estimating the unknown function f∗. Working within a high-dimensional framework t...

متن کامل

Minimax rates of estimation for high-dimensional linear regression over lq-balls

Consider the high-dimensional linear regression model y = Xβ∗ +w, where y ∈ R is an observation vector, X ∈ R is a design matrix with d > n, the quantity β∗ ∈ R is an unknown regression vector, and w ∼ N (0, σI) is additive Gaussian noise. This paper studies the minimax rates of convergence for estimating β∗ in either l2-loss and l2-prediction loss, assuming that β∗ belongs to an lq-ball Bq(Rq)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1503.02817  شماره 

صفحات  -

تاریخ انتشار 2015